منابع مشابه
Numerical study of the effects of trailing-edge bluntness on highly turbulent hydro-foil flows
Flow-induced noise from fully submerged lifting bodies experiencing turbulent trailing edge flows continues to pose undesirable effects for many marine propulsion systems and control surfaces.This noises arises from unsteady oscillatory flow has been shown to be highly dependent on trailing edge geometry, which can also lead to unacceptable structural vibrations. This paper presents a numerical...
متن کاملStatistical Estimation of Turbulent Trailing Edge Noise
A new computational aeroacoustic model suitable for the prediction of turbulent airfoil trailing edge noise is presented. The method (known as the RANS based Statistical Noise Model or RSNM) combines numerically generated, mean turbulence information with a Green’s function for a semi-infinite half-plane to generate a far-field acoustic auto-spectrum. As a preliminary application of the method,...
متن کاملLES tests on airfoil trailing edge serration
In the present study, a large number of acoustic simulations are carried out for a low noise airfoil with different Trailing Edge Serrations (TES). The Ffowcs Williams-Hawkings (FWH) acoustic analogy is used for noise prediction at trailing edge. The acoustic solver is running on the platform of our in-house incompressible flow solver EllipSys3D. The flow solution is first obtained from the Lar...
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملEigenvalues of 2-edge-coverings
A 2-edge-covering between G and H is an onto homomorphism from the vertices of G to the vertices of H so that each edge is covered twice and edges in H can be lifted back to edges in G. In this note we show how to compute the spectrum of G by computing the spectrum of two smaller graphs, namely a (modified) form of the covered graph H and another graph which we term the anti-cover. This is done...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1975
ISSN: 1446-7887,1446-8107
DOI: 10.1017/s1446788700029505